Particle Swarm Optimization for Integer Programming
نویسندگان
چکیده
The investigation of the performance of the Particle Swarm Optimization (PSO) method in Integer Programming problems, is the main theme of the present paper. Three variants of PSO are compared with the widely used Branch and Bound technique, on several Integer Programming test problems. Results indicate that PSO handles e ciently such problems, and in most cases it outperforms the Branch and Bound technique.
منابع مشابه
A Modified Discreet Particle Swarm Optimization for a Multi-level Emergency Supplies Distribution Network
Currently, the research of emergency supplies distribution and decision models mostly focus on deterministic models and exact algorithm. A few of studies have been done on the multi-level distribution network and matheuristic algorithm. In this paper, random processes theory is adopted to establish emergency supplies distribution and decision model for multi-level network. By analyzing the char...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملNovel Mutative Particle Swarm Optimization Algorithm for Discrete Optimization
Mutative Particle Swarm Optimization (MPSO) is swarm-based stochastic optimization algorithm combined with the mutative function inspired by Genetic Algorithm (GA). The algorithm searches for the solution by combining swarming behavior, as well as mutation of the particles to accelerate the search process. This paper presents a modification to the MPSO algorithm for it to solve Integer Programm...
متن کاملA Branch and Bound-PSO Hybrid Algorithm for Solving Integer Separable Concave Programming Problems
A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programming relax and the upper bound of the optimal value and the best feasible solution at present were found and renewed with particle swarm optimization (PSO). It is shown by the numerical results that ...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کامل